An integer fixed-charge multicommodity flow (FCMF) model for train unit scheduling
نویسندگان
چکیده
An integer fixed-charge multicommodity flow (FCMF) model is used as the first part of a two-phase approach for train unit scheduling, and solved by an exact branchand-price method. To strengthen knapsack constraints and deal with complicated scenarios arisen in the integer linear program (ILP) from the integer FCMF model, preprocessing is used by computing convex hulls of sets of points representing all possible train formations utilizing multiple unit types.
منابع مشابه
A two-phase approach for real-world train unit scheduling
A two-phase approach for the train unit scheduling problem is proposed. The first phase assigns and sequences train trips to train units temporarily ignoring some station infrastructure details. Real-world scenarios such as compatibility among traction types and banned/restricted locations and time allowances for coupling/decoupling are considered. Its solutions would be near-operable. The seco...
متن کاملMulticommodity Flow Problems with Commodity Compatibility Relations
We present a class of Multicommodity Flow Problems with Commodity Compatibility Relations (MCFP-CCR), in which compatibility relations among commodities used at each node are required. This class of problems has application in the Train Unit Scheduling Problem (TUSP) [1, 2], where train units of different traction types may not be coupled with each other to serve the same train trip. Computatio...
متن کاملA Cutting-Plane Algorithm for Multicommodity Capacitated Fixed-Charge Network Design
We improve the mixed-integer programming formulation of the multicommodity capacitated fixed-charge network design problem by incorporating valid inequalities into a cutting-plane algorithm. We use five classes of valid inequalities: the strong, cover, minimum cardinality, flow cover, and flow pack inequalities, the last four being expressed in terms of cutsets of the network. We develop effici...
متن کاملBranch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem
with an Application to the Multicommodity Fixed Charge Network Flow Problem Mike Hewitt Department of Industrial and Systems Engineering, Rochester Institute of Technology, Rochester, NY 14623, USA, [email protected], George Nemhauser H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332, USA, [email protected], Martin W.P...
متن کاملA Mathematical Model and a Solution Method for Hybrid Flow Shop Scheduling
This paper studies the hybrid flow shop scheduling where the optimization criterion is the minimization of total tardiness. First, the problem is formulated as a mixed integer linear programming model. Then, to solve large problem sizes, an artificial immune algorithm hybridized with a simple local search in form of simulated annealing is proposed. Two experiments are carried out to evaluate th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 41 شماره
صفحات -
تاریخ انتشار 2013